Partial correlation graphs and the neighborhood lattice
نویسندگان
چکیده
We define and study partial correlation graphs (PCGs) with variables in a general Hilbert space and their connections to generalized neighborhood regression, without making any distributional assumptions. Using operator-theoretic arguments, and especially the properties of projection operators on Hilbert spaces, we show that these neighborhood regressions have the algebraic structure of a lattice, which we call a neighborhood lattice. This lattice property significantly reduces the number of conditions one has to check when testing all partial correlation relations among a collection of variables. In addition, we generalize the notion of perfectness in graphical models for a general PCG to this Hilbert space setting, and establish that almost all Gram matrices are perfect. Under this perfectness assumption, we show how these neighborhood lattices may be “graphically” computed using separation properties of PCGs. We also discuss extensions of these ideas to directed models, which present unique challenges compared to their undirected counterparts. Our results have implications for multivariate statistical learning in general, including structural equation models, subspace clustering, and dimension reduction. For example, we discuss how to compute neighborhood lattices efficiently and furthermore how they can be used to reduce the sample complexity of learning directed acyclic graphs. Our work demonstrates that this abstract viewpoint via projection operators significantly simplifies existing ideas and arguments from the graphical modeling literature, and furthermore can be used to extend these ideas to more general nonparametric settings.
منابع مشابه
Spectra of some new extended corona
For two graphs $mathrm{G}$ and $mathrm{H}$ with $n$ and $m$ vertices, the corona $mathrm{G}circmathrm{H}$ of $mathrm{G}$ and $mathrm{H}$ is the graph obtained by taking one copy of $mathrm{G}$ and $n$ copies of $mathrm{H}$ and then joining the $i^{th}$ vertex of $mathrm{G}$ to every vertex in the $i^{th}$ copy of $mathrm{H}$. The neighborhood corona $mathrm{G}starmathrm{H}$ of $mathrm{G}$ and $...
متن کاملOn common neighborhood graphs II
Let G be a simple graph with vertex set V (G). The common neighborhood graph or congraph of G, denoted by con(G), is a graph with vertex set V (G), in which two vertices are adjacent if and only if they have at least one common neighbor in G. We compute the congraphs of some composite graphs. Using these results, the congraphs of several special graphs are determined.
متن کاملThe Family of Conceptual Neighborhood Graphs for Region-Region Relations
This paper revisits conceptual neighborhood graphs for the topological relations between two regions, in order to bridge from the A-B-C neighborhoods defined for interval relations in R to region relations in R and on the sphere S. A categorization of deformation types—built from same and different positions, orientations, sizes, and shapes—gives rise to four different neighborhood graphs. They...
متن کاملCharacteristics of Common Neighborhood Graph under Graph Operations and on Cayley Graphs
Let G(V;E) be a graph. The common neighborhood graph (congraph) of G is a graph with vertex set V , in which two vertices are adjacent if and only if they have a common neighbor in G. In this paper, we obtain characteristics of congraphs under graph operations; Graph :::::union:::::, Graph cartesian product, Graph tensor product, and Graph join, and relations between Cayley graphs and its c...
متن کاملCharacterizations of $L$-convex spaces
In this paper, the concepts of $L$-concave structures, concave $L$-interior operators and concave $L$-neighborhood systems are introduced. It is shown that the category of $L$-concave spaces and the category of concave $L$-interior spaces are isomorphic, and they are both isomorphic to the category of concave $L$-neighborhood systems whenever $L$ is a completely distributive lattice. Also, it i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1711.00991 شماره
صفحات -
تاریخ انتشار 2017